bounding volume

bounding volume
bryła ograniczająca

English-Polish dictionary of Electronics and Computer Science. 2013.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Bounding volume — A three dimensional model with its bounding box drawn in dashed lines. For building code compliance, see Bounding. In computer graphics and computational geometry, a bounding volume for a set of objects is a closed volume that completely contains …   Wikipedia

  • Bounding Volume — Ein dreidimensionaler Körper und die entsprechende Bounding Box (in weiß) Ein Bounding Volume ist in der algorithmischen Geometrie ein einfacher geometrischer Körper, der ein komplexes dreidimensionales Objekt oder einen komplexen Körper… …   Deutsch Wikipedia

  • Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful …   Wikipedia

  • Bounding sphere — In mathematics, given a non empty set of objects of finite extension in n dimensional space, for example a set of points, a bounding sphere, enclosing sphere or enclosing ball for that set is an n dimensional solid sphere containing all of these… …   Wikipedia

  • Bounding Box — Ein dreidimensionaler Körper und die entsprechende Bounding Box (in weiß) Ein Bounding Volume ist in der algorithmischen Geometrie ein einfacher geometrischer Körper, der ein komplexes dreidimensionales Objekt oder einen komplexen Körper… …   Deutsch Wikipedia

  • Volume ray casting — Volume ray casting, sometimes called volumetric ray casting, is an image based volume rendering technique. It computes 2D images from 3D volumetric data sets. Volume ray casting, which processes volume data, must not be mistaken with ray casting …   Wikipedia

  • Minimum bounding box — The minimum or smallest bounding or enclosing box for a point set in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie. When other kinds of measure are used, the… …   Wikipedia

  • Minimum bounding box algorithms — In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. Smallest may refer to volume, area, perimeter, etc. of the box. It is… …   Wikipedia

  • Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… …   Wikipedia

  • Sweep and prune — In physical simulations, sweep and prune is a broad phase algorithm used during collision detection to limit the number of pairs of solids that need to be checked for collision, i.e. intersection. This is achieved by sorting the starts (lower… …   Wikipedia

  • Kollisionsabfrage — Als Kollisionserkennung oder Kollisionsabfrage (engl. Collision Detection) wird in der Algorithmischen Geometrie, Computer Aided Design, Computersimulation, animation und grafik sowie in der Robotik das Erkennen des Berührens oder Überlappens… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”